Structural decomposition

In this report we present an algorithm for the decomposition of a mono-lithic LOTOS process into two processes, which composed by the parallel operator is observational equivalent to the original one. Repeated application permits the generation of more than two processes. The algorithm is deened on labelled transition systems and, hence, its application to any process algebra with a similar notion of parallel composition is straightforward. The transformation is based on a given partition of the actions into two subsets , corresponding to the action sets of the generated processes. The main interest of the transformation is that the amount of synchronizations between the two generated processes is kept low. The Structural Decomposition has several applications, like the decomposition of functionality, modularization, synthesizing of protocols, decomposition of tests, etc...